Geometric Two-Server Algorithms
نویسندگان
چکیده
For two servers in d-dimensional space under the L 1 metric, we give an optimal 2-competitive algorithm which uses constant time and space per request. This considerably extends the class of metric spaces for which an optimal, fast two-server algorithm is known; previously, the only such spaces were those that could be embedded in a tree. The algorithm itself can be seen as a higher-dimensional generalization of the \double-coverage" strategy of Chrobak et al.
منابع مشابه
Analyses of a Markovian queue with two heterogeneous servers and working vacation
This paper analyzes an M/M/2 queueing system with two heterogeneous servers. Both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. The vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady st...
متن کاملWorking Vacation Queue with Second Optional Service and Unreliable Server
An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...
متن کاملConstrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising from a geometric client-server problem. The second is the problem of moving points towards an independent set.
متن کاملMachine Repair Queueing System with with Non-Reliable Service Stations And Heterogeneous Service Discipline (RESEARCH NOTE)
This investigation deals with M/M/R/N machine repair problem with R non-reliable service stations which are subjected to unpredictable breakdown. 1here is provision of an additional server to reduce backlog in the case of heavy load of failed machines. 1he permanent service stations repair the failed machines at an identical rate m and switch to faster repair rate when all service stations are ...
متن کاملOptimization Models for a Deteriorating Single Server Queuing Production System
In this paper a single server queuing production system is considered which is subject to gradual deterioration. The system is discussed under two different deteriorating conditions. A planning horizon is considered and server which is a D/M/1 queuing system is gradually deteriorates through time periods. A maintenance policy is taken into account whereby the server is restored to its initial ...
متن کاملAnalysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 53 شماره
صفحات -
تاریخ انتشار 1995